as a generalization of the triple i method, the universal triple imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. the universal triple i principle is putforward, which improves the previous triple i principle. then,unified form of universal triple i method is established based onthe (0,1)-implication or r-implication. moreover, the reversibilityproperty o...

Marcus Berger, University of Michigan 0. While much recent work has focused on various nominal and verbal properties of syntactic nominalizations, relatively little work has investigated how their internal structure is derived. Many authors adopt a ‘mixed projection’ hierarchy in which verbal projections appear interpolated into an otherwise nominal hierarchy. The resulting combination of proje...

Models of contour interpolation have been proposed for illusory contour interpolation but seldom for interpolation of occluded contours. The identity hypothesis (Kellman & Loukides, 1987; Kellman & Shipley, 1991) posits that an early interpolation mechanism is shared by interpolated contours that are ultimately perceived as either illusory or occluded. Here we propose a model of such a unified ...

The original idea of reasoning and control within fuzzy rule bases was proposed by Zadeh [1], and was called the Compositional Rule of Inference (CRI) and had the disadvantage of running directly in the k-dimensional input space (where k is the number of variables) while being able however to describe multi-dimensional membership function distributions of arbitrary shape. Its modified version, ...

The iterative back-projection (IBP) algorithm for single image super-resolution (SR) can not guarantee the edge smoothness because the reconstruction error is back-projected isotropically. Furthermore, in the case that there is only one low-resolution input, the estimation of the reconstruction error is easily affected by noise. Thus, this algorithm is highly sensitive to noise. The focus of th...

We derive both local and global Sobolev interpolation inequalities of any higher orders for the Folland-Stein Sobolev spaces on stratified nilpotent Lie groups G and on domains satisfying a certain chain condition. Weighted versions of such inequalities are also included for doubling weights satisfying a weighted Poincaré inequality. This paper appears to be the first one to deal with general S...

In this paper we study the existence and characterization of spaces which are images of minimal-norm projections that are required to interpolate at given functionals and satisfy additional shape-preserving requirements. We will call such spaces optimal interpolating spaces preserving shape. This investigation leads to concrete solutions in classical settings and, as examples, n will be determi...

We present recent results on the scattering of plane waves in piecewise constant layered media, introducing a new geometric perspective. It turns out that the classical inverse scattering problem generically decouples into two separate problems. One problem is to recover a line from the magnitudes of the projections onto the line of a set of lattice points. The second problem is to determine wh...

Interpolation means finding intermediate formulae between given formulae. When formulae decorate program locations, and describe sets of program states, interpolation may enable a program analyzer to discover information about intermediate locations and states. This mechanism has an increasing number of applications, that are relevant to program analysis and synthesis. We study interpolation in...

1. I N T R O D U C T I O N A well-known Faber theorem asserts that given any sequence Pn of projections from C ([0, 1]) onto the space q3n of polynomials of degree n 1, there exists a continuous function f such that Pn f does not converge to f in the uniform norm. In particular, let A n : 0 < t~ n) < t~ n) < . . . < t (n) < 1 be a sequence of partitions on the interval [0, 1]. Let L (An) : C ([...